Sciweavers

2354 search results - page 116 / 471
» A Common-Sense Theory of Time
Sort
View
COMPGEOM
2006
ACM
14 years 2 months ago
How slow is the k-means method?
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
David Arthur, Sergei Vassilvitskii
ICNC
2005
Springer
14 years 1 months ago
Representation of a Physio-psychological Index Through Constellation Graphs
Fingertip pulsations (plethysmograms) were found to obey chaotic dynamics [1]. We applied chaos theory to analysis of the time series of plethysmograms under various human physio-p...
Mayumi Oyama-Higa, Tiejun Miao
COCO
1998
Springer
103views Algorithms» more  COCO 1998»
14 years 13 days ago
Nonrelativizing Separations
We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to K...
Harry Buhrman, Lance Fortnow, Thomas Thierauf
CSB
2004
IEEE
112views Bioinformatics» more  CSB 2004»
13 years 12 months ago
Inferring Genetic Networks from Microarray Data
In theory, it should be possible to infer realistic genetic networks from time series microarray data. In practice, however, network discovery has proved problematic. The three ma...
Shawn Martin, George Davidson, Elebeoba E. May, Je...
WSC
2000
13 years 9 months ago
An analytical model and an optimal scheduling heuristic for collective resource management
In the this paper, we study the problem of collective resource management. We first introduce the problem through realworld examples. Then we generalize the problem and build an a...
Qiang Sun