Sciweavers

537 search results - page 102 / 108
» A new upper bound for 3-SAT
Sort
View
IMC
2009
ACM
14 years 2 months ago
TCP revisited: a fresh look at TCP in the wild
Since the last in-depth studies of measured TCP traffic some 68 years ago, the Internet has experienced significant changes, including the rapid deployment of backbone links wit...
Feng Qian, Alexandre Gerber, Zhuoqing Morley Mao, ...
ICDM
2007
IEEE
183views Data Mining» more  ICDM 2007»
14 years 2 months ago
Depth-Based Novelty Detection and Its Application to Taxonomic Research
It is estimated that less than 10 percent of the world’s species have been described, yet species are being lost daily due to human destruction of natural habitats. The job of d...
Yixin Chen, Henry L. Bart Jr., Xin Dang, Hanxiang ...
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
14 years 14 days ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
MOBICOM
2010
ACM
13 years 8 months ago
ZiFi: wireless LAN discovery via ZigBee interference signatures
WiFi networks have enjoyed an unprecedent penetration rate in recent years. However, due to the limited coverage, existing WiFi infrastructure only provides intermittent connectiv...
Ruogu Zhou, Yongping Xiong, Guoliang Xing, Limin S...
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
14 years 9 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan