@article{journals/pe/ShiBM09,
  added-at = {2012-02-14T00:00:00.000+0100},
  author = {Shi, Zhefu and Beard, Cory and Mitchell, Kenneth},
  biburl = {http://www.bibsonomy.org/bibtex/2ad6d57c0456333202f9935e9e6ef26cf/dblp},
  ee = {http://dx.doi.org/10.1016/j.peva.2009.02.002},
  interhash = {534fa12c0a68d6705682247356e53c56},
  intrahash = {ad6d57c0456333202f9935e9e6ef26cf},
  journal = {Perform. Eval.},
  keywords = {dblp},
  number = {9-10},
  pages = {469-487},
  title = {Analytical models for understanding misbehavior and MAC friendliness in CSMA networks.},
  url = {http://dblp.uni-trier.de/db/journals/pe/pe66.html#ShiBM09},
  volume = 66,
  year = 2009
}

@inproceedings{conf/wcnc/ZhouM07,
  added-at = {2012-02-14T00:00:00.000+0100},
  author = {Zhou, Jiazhen and Mitchell, Kenneth},
  biburl = {http://www.bibsonomy.org/bibtex/27e9c3d8fe7beb8c396dbd204f5393db7/dblp},
  booktitle = {WCNC},
  crossref = {conf/wcnc/2007},
  ee = {http://doi.ieeecomputersociety.org/10.1109/WCNC.2007.730},
  interhash = {bcd633a69e68089ab9695db62c115776},
  intrahash = {7e9c3d8fe7beb8c396dbd204f5393db7},
  isbn = {1-4244-0658-7},
  keywords = {dblp},
  pages = {3996-4001},
  publisher = {IEEE},
  title = {A Single Node Decomposition Based Analytic Model for Multiclass Route Optimization in Wireless Mesh Networks.},
  url = {http://dblp.uni-trier.de/db/conf/wcnc/wcnc2007.html#ZhouM07},
  year = 2007
}

@inproceedings{conf/wcnc/ShiBM07,
  added-at = {2012-02-14T00:00:00.000+0100},
  author = {Shi, Zhefu and Beard, Cory and Mitchell, Kenneth},
  biburl = {http://www.bibsonomy.org/bibtex/212c08b2be27f20b78e8d787749b15af5/dblp},
  booktitle = {WCNC},
  crossref = {conf/wcnc/2007},
  ee = {http://doi.ieeecomputersociety.org/10.1109/WCNC.2007.71},
  interhash = {ec9059cf72caaf159c2e6a92e39b2a21},
  intrahash = {12c08b2be27f20b78e8d787749b15af5},
  isbn = {1-4244-0658-7},
  keywords = {dblp},
  pages = {355-360},
  publisher = {IEEE},
  title = {Misbehavior and MAC Friendliness in CSMA Networks.},
  url = {http://dblp.uni-trier.de/db/conf/wcnc/wcnc2007.html#ShiBM07},
  year = 2007
}

@inproceedings{conf/pe-wasun/ShiBM11,
  added-at = {2012-02-14T00:00:00.000+0100},
  author = {Shi, Zhefu and Beard, Cory and Mitchell, Kenneth},
  biburl = {http://www.bibsonomy.org/bibtex/2a3e57d89ba254495a0e07b5c09453726/dblp},
  booktitle = {PE-WASUN},
  crossref = {conf/pe-wasun/2011},
  editor = {Lassous, Isabelle Guérin and Aguilar-Igartua, Mónica and Cuomo, Francesca},
  ee = {http://doi.acm.org/10.1145/2069063.2069084},
  interhash = {f9d33f9b3eb87f1cb56a7e00f7b5ec57},
  intrahash = {a3e57d89ba254495a0e07b5c09453726},
  isbn = {978-1-4503-0900-4},
  keywords = {dblp},
  pages = {117-120},
  publisher = {ACM},
  title = {Competition, cooperation, and optimization in Multi-Hop CSMA networks.},
  url = {http://dblp.uni-trier.de/db/conf/pe-wasun/pe-wasun2011.html#ShiBM11},
  year = 2011
}

@article{rbkmsw-dbir-08,
  abstract = {In geographic information retrieval, queries often
                  utilize names of geographic regions that do not have
                  a well-defined boundary, such as ``Southern
                  France.'' We provide two classes of algorithms for
                  the problem of computing reasonable boundaries of
                  such regions, based on evidence of given data points
                  that are deemed likely to lie either inside or
                  outside the region. Our problem formulation leads to
                  a number of problems related to red-blue point
                  separation and minimum-perimeter polygons, many of
                  which we solve algorithmically. We give experimental
                  results from our implementation and a comparison of
                  the two approaches.},
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {Reinbacher, Iris and Benkert, Marc and van Kreveld, Marc and Mitchell, Joseph S.B. and Snoeyink, Jack and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/20548c42b7d7b826410d648ad5f7f2235/awolff},
  doi = {10.1007/s00453-007-9042-5},
  interhash = {61832d5d11ed73a910eb53cff7651be3},
  intrahash = {0548c42b7d7b826410d648ad5f7f2235},
  journal = {Algorithmica},
  keywords = {red-blue_separation myown minimum_perimeter_polygon imprecise_regions GIS},
  number = 3,
  pages = {386--414},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/rbkmsw-dbir-07.pdf},
  succeeds = {rbkmw-dbir-05},
  title = {Delineating Boundaries for Imprecise Regions},
  url = {http://dx.doi.org/10.1007/s00453-007-9042-5},
  volume = 50,
  year = 2008
}

@inproceedings{rbkmw-dbir-05,
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {Reinbacher, Iris and Benkert, Marc and van Kreveld, Marc and Mitchell, Joseph S.B. and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/220f450b7f6dfd05041c35a759027fcef/awolff},
  booktitle = {Proc. 13th Annu. Europ. Symp. on Algorithms
                  (ESA'05)},
  confmonth = {{3--6~}#oct},
  doi = {10.1007/11561071_15},
  editor = {Brodal, Gerth St{\o}lting and Leonardi, Stefano},
  interhash = {22ea1c83378519a72bc0e7f9ac3468af},
  intrahash = {20f450b7f6dfd05041c35a759027fcef},
  keywords = {myown},
  location = {Eivissa, Spain},
  pages = {143--154},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/rbkmw-dbir-05.pdf},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  succeeds = {rbkw-dbir-05},
  title = {Delineating Boundaries for Imprecise Regions},
  url = {http://dx.doi.org/10.1007/11561071_15},
  volume = 3669,
  year = 2005
}

@article{journals/cm/GhataouraMM11,
  added-at = {2012-02-13T00:00:00.000+0100},
  author = {Ghataoura, Darminder Singh and Mitchell, John E. and Matich, George},
  biburl = {http://www.bibsonomy.org/bibtex/23b5e31b6b333e189df0dc3878c624d46/dblp},
  ee = {http://dx.doi.org/10.1109/MCOM.2011.6035821},
  interhash = {653f77cfd041327b55bb887f59223d17},
  intrahash = {3b5e31b6b333e189df0dc3878c624d46},
  journal = {IEEE Communications Magazine},
  keywords = {dblp},
  number = 10,
  pages = {90-97},
  title = {Networking and application interface technology for wireless sensor network surveillance and monitoring.},
  url = {http://dblp.uni-trier.de/db/journals/cm/cm49.html#GhataouraMM11},
  volume = 49,
  year = 2011
}

@article{journals/icl/NgM04,
  added-at = {2012-02-13T00:00:00.000+0100},
  author = {Ng, Siaw-Lynn and Mitchell, Chris},
  biburl = {http://www.bibsonomy.org/bibtex/2d2f87ccdeb125dd9d122997345c330a3/dblp},
  ee = {http://dx.doi.org/10.1109/LCOMM.2004.825724},
  interhash = {4fff8bafc3f883617a0b2cdb7ef43f4b},
  intrahash = {d2f87ccdeb125dd9d122997345c330a3},
  journal = {IEEE Communications Letters},
  keywords = {dblp},
  number = 4,
  pages = {262-263},
  title = {Comments on mutual authentication and key exchange protocols for low power wireless communications.},
  url = {http://dblp.uni-trier.de/db/journals/icl/icl8.html#NgM04},
  volume = 8,
  year = 2004
}

@inproceedings{conf/wsdm/TalukdarWM12,
  added-at = {2012-02-13T00:00:00.000+0100},
  author = {Talukdar, Partha Pratim and Wijaya, Derry Tanti and Mitchell, Tom},
  biburl = {http://www.bibsonomy.org/bibtex/2a0c6baaa8de4609c35635ae9d08e8bc5/dblp},
  booktitle = {WSDM},
  crossref = {conf/wsdm/2012},
  editor = {Adar, Eytan and Teevan, Jaime and Agichtein, Eugene and Maarek, Yoelle},
  ee = {http://doi.acm.org/10.1145/2124295.2124307},
  interhash = {ed83b1c1b2e07f869adec52b6c1f65e3},
  intrahash = {a0c6baaa8de4609c35635ae9d08e8bc5},
  isbn = {978-1-4503-0747-5},
  keywords = {dblp},
  pages = {73-82},
  publisher = {ACM},
  title = {Coupled temporal scoping of relational facts.},
  url = {http://dblp.uni-trier.de/db/conf/wsdm/wsdm2012.html#TalukdarWM12},
  year = 2012
}

@article{journals/icl/MinkenbergAG05,
  added-at = {2012-02-11T00:00:00.000+0100},
  author = {Minkenberg, Cyriel and Abel, François and Gusat, Mitchell},
  biburl = {http://www.bibsonomy.org/bibtex/2430ba2b8cfb198826b56f179cd33a710/dblp},
  ee = {http://dx.doi.org/10.1109/LCOMM.2005.02018},
  interhash = {f7dd32bed7ec62d266dd7dd5490ab227},
  intrahash = {430ba2b8cfb198826b56f179cd33a710},
  journal = {IEEE Communications Letters},
  keywords = {dblp},
  number = 2,
  pages = {178-180},
  title = {Reliable control protocol for crossbar arbitration.},
  url = {http://dblp.uni-trier.de/db/journals/icl/icl9.html#MinkenbergAG05},
  volume = 9,
  year = 2005
}

@article{journals/tit/ErezTW12,
  added-at = {2012-02-10T00:00:00.000+0100},
  author = {Erez, Uri and Trott, Mitchell D. and Wornell, Gregory W.},
  biburl = {http://www.bibsonomy.org/bibtex/26f8a6f955735d75d1b43565f29fd9d13/dblp},
  ee = {http://doi.ieeecomputersociety.org/10.1109/TIT.2011.2173242},
  interhash = {4dddb63a3603768dbc04fa741e56c829},
  intrahash = {6f8a6f955735d75d1b43565f29fd9d13},
  journal = {IEEE Transactions on Information Theory},
  keywords = {dblp},
  number = 2,
  pages = {530-547},
  title = {Rateless Coding for Gaussian Channels.},
  url = {http://dblp.uni-trier.de/db/journals/tit/tit58.html#ErezTW12},
  volume = 58,
  year = 2012
}

@article{journals/tsp/Al-SmadiW02,
  added-at = {2012-02-09T00:00:00.000+0100},
  author = {Al-Smadi, Adnan and Wilkes, D. Mitchell},
  biburl = {http://www.bibsonomy.org/bibtex/22e8849151f3d8698b8ad81abc22bb868/dblp},
  ee = {http://dx.doi.org/10.1109/78.984778},
  interhash = {212dbc2a8e6ee729b76ddfed7691fa2a},
  intrahash = {2e8849151f3d8698b8ad81abc22bb868},
  journal = {IEEE Transactions on Signal Processing},
  keywords = {dblp},
  number = 3,
  pages = {759-763},
  title = {Robust and accurate ARX and ARMA model order estimation of non-Gaussian processes.},
  url = {http://dblp.uni-trier.de/db/journals/tsp/tsp50.html#Al-SmadiW02},
  volume = 50,
  year = 2002
}

@article{journals/scn/KoungaMW12,
  added-at = {2012-02-08T00:00:00.000+0100},
  author = {Kounga, G. and Mitchell, C. J. and Walter, T.},
  biburl = {http://www.bibsonomy.org/bibtex/2eb8804846e45aa28afbb467194f2c9f6/dblp},
  ee = {http://dx.doi.org/10.1002/sec.279},
  interhash = {a543804c3485310112220ebe70816265},
  intrahash = {eb8804846e45aa28afbb467194f2c9f6},
  journal = {Security and Communication Networks},
  keywords = {dblp},
  number = 1,
  pages = {87-106},
  title = {Generating certification authority authenticated public keys in ad hoc networks.},
  url = {http://dblp.uni-trier.de/db/journals/scn/scn5.html#KoungaMW12},
  volume = 5,
  year = 2012
}

@inproceedings{conf/cccg/ArkinAMM11,
  added-at = {2012-02-08T00:00:00.000+0100},
  author = {Arkin, Esther M. and Anta, Antonio Fernández and Mitchell, Joseph S. B. and Mosteiro, Miguel A.},
  biburl = {http://www.bibsonomy.org/bibtex/2e6baa9bc778d36e29934e3639f2525ae/dblp},
  booktitle = {CCCG},
  crossref = {conf/cccg/2011},
  ee = {http://www.cccg.ca/proceedings/2011/papers/paper42.pdf},
  interhash = {2ccdb584a9a3c60bb752c2455eda6404},
  intrahash = {e6baa9bc778d36e29934e3639f2525ae},
  keywords = {dblp},
  title = {Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions.},
  url = {http://dblp.uni-trier.de/db/conf/cccg/cccg2011.html#ArkinAMM11},
  year = 2011
}

@inproceedings{conf/itc/KinraMSMV98,
  added-at = {2012-02-08T00:00:00.000+0100},
  author = {Kinra, Anjali and Mehta, Aswin and Smith, Neal and Mitchell, Jackie and Valente, Fred},
  biburl = {http://www.bibsonomy.org/bibtex/2910fc737918ec30c726ce4c84892fe12/dblp},
  booktitle = {ITC},
  crossref = {conf/itc/1998},
  ee = {http://doi.ieeecomputersociety.org/10.1109/TEST.1998.743189},
  interhash = {b22001a089f37fdfff5bdae4706c04b2},
  intrahash = {910fc737918ec30c726ce4c84892fe12},
  isbn = {0-7803-5093-6},
  keywords = {dblp},
  pages = {480-486},
  publisher = {IEEE Computer Society},
  title = {Diagnostic techniques for the UltraSPARC microprocessors.},
  url = {http://dblp.uni-trier.de/db/conf/itc/itc1998.html#KinraMSMV98},
  year = 1998
}

@inproceedings{conf/itc/LinCHSCL05,
  added-at = {2012-02-07T00:00:00.000+0100},
  author = {Lin, Mitchell and Cheng, Kwang-Ting and Hsu, Jimmy and Sun, M. C. and Chen, Jason and Lu, Shelton},
  biburl = {http://www.bibsonomy.org/bibtex/2cf6c588d5fded74dbd9329bc860c1f19/dblp},
  booktitle = {ITC},
  crossref = {conf/itc/2005},
  ee = {http://doi.ieeecomputersociety.org/10.1109/TEST.2005.1584028},
  interhash = {efcef8da725e7fb5bc9e7bccb2698a1c},
  intrahash = {cf6c588d5fded74dbd9329bc860c1f19},
  isbn = {0-7803-9038-5},
  keywords = {dblp},
  pages = 10,
  publisher = {IEEE},
  title = {Production-oriented interface testing for PCI-Express by enhanced loop-back technique.},
  url = {http://dblp.uni-trier.de/db/conf/itc/itc2005.html#LinCHSCL05},
  year = 2005
}

@inproceedings{conf/itc/LinC06a,
  added-at = {2012-02-07T00:00:00.000+0100},
  author = {Lin, Mitchell and Cheng, Kwang-Ting},
  biburl = {http://www.bibsonomy.org/bibtex/20199721859321618bde80eb81d8cd679/dblp},
  booktitle = {ITC},
  crossref = {conf/itc/2006},
  editor = {Davidson, Scott and Gattiker, Anne},
  ee = {http://dx.doi.org/10.1109/TEST.2006.297698},
  interhash = {8950fb3e422eeadced73990fcce240d2},
  intrahash = {0199721859321618bde80eb81d8cd679},
  isbn = {1-4244-0292-1},
  keywords = {dblp},
  pages = {1-10},
  publisher = {IEEE},
  title = {Testable Design for Adaptive Linear Equalizer in High-Speed Serial Links.},
  url = {http://dblp.uni-trier.de/db/conf/itc/itc2006.html#LinC06a},
  year = 2006
}

@article{journals/mmas/BelikL11,
  added-at = {2012-02-06T00:00:00.000+0100},
  author = {Belík, Pavel and Luskin, Mitchell},
  biburl = {http://www.bibsonomy.org/bibtex/2b5f857a0de3188d41e7eb84b76d8fbb2/dblp},
  ee = {http://dx.doi.org/10.1137/100806242},
  interhash = {f21316a15828ae744a2b58d4cf88e675},
  intrahash = {b5f857a0de3188d41e7eb84b76d8fbb2},
  journal = {Multiscale Modeling & Simulation},
  keywords = {dblp},
  number = 4,
  pages = {1495-1527},
  title = {Analysis of the Quasi-Nonlocal Approximation of Linear and Circular Chains in the Plane.},
  url = {http://dblp.uni-trier.de/db/journals/mmas/mmas9.html#BelikL11},
  volume = 9,
  year = 2011
}

@article{Craven200069,
  abstract = {The World Wide Web is a vast source of information accessible to computers, but understandable only to humans. The goal of the research described here is to automatically create a computer understandable knowledge base whose content mirrors that of the World Wide Web. Such a knowledge base would enable much more effective retrieval of Web information, and promote new uses of the Web to support knowledge-based inference and problem solving. Our approach is to develop a trainable information extraction system that takes two inputs. The first is an ontology that defines the classes (e.g., company, person, employee, product) and relations (e.g., employed_by, produced_by) of interest when creating the knowledge base. The second is a set of training data consisting of labeled regions of hypertext that represent instances of these classes and relations. Given these inputs, the system learns to extract information from other pages and hyperlinks on the Web. This article describes our general approach, several machine learning algorithms for this task, and promising initial results with a prototype system that has created a knowledge base describing university people, courses, and research projects.},
  added-at = {2012-02-02T16:13:22.000+0100},
  author = {Craven, Mark and DiPasquo, Dan and Freitag, Dayne and McCallum, Andrew and Mitchell, Tom and Nigam, Kamal and Slattery, Seán},
  biburl = {http://www.bibsonomy.org/bibtex/25a061b694a475d34557c7e0a9ff9854b/telekoma},
  description = {Learning to construct knowledge bases from the World Wide Web 10.1016/S0004-3702(00)00004-7 : Artificial Intelligence | ScienceDirect.com},
  doi = {10.1016/S0004-3702(00)00004-7},
  interhash = {68683ddac8974e9b3867c4b076a2b52f},
  intrahash = {5a061b694a475d34557c7e0a9ff9854b},
  issn = {0004-3702},
  journal = {Artificial Intelligence},
  keywords = {ai bachelor:2011:bachmann naiveBayes webclassificatoion www},
  number = {1–2},
  pages = {69 - 113},
  title = {Learning to construct knowledge bases from the World Wide Web},
  url = {http://www.sciencedirect.com/science/article/pii/S0004370200000047},
  volume = 118,
  year = 2000
}

@article{journals/eccc/ECCC-TR04-012,
  added-at = {2012-02-02T00:00:00.000+0100},
  author = {Beame, Paul and Culberson, Joseph C. and Mitchell, David G. and Moore, Cristopher},
  biburl = {http://www.bibsonomy.org/bibtex/29311179443c9ed831db7b15ece50627a/dblp},
  ee = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-012/index.html},
  interhash = {3d2e6e6c4eea9e8663c317a96be482fc},
  intrahash = {9311179443c9ed831db7b15ece50627a},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  keywords = {dblp},
  number = 012,
  title = {The Resolution Complexity of Random Graph k-Colorability},
  url = {http://dblp.uni-trier.de/db/journals/eccc/eccc11.html#ECCC-TR04-012},
  year = 2004
}