Sciweavers

6274 search results - page 1043 / 1255
» From query complexity to computational complexity
Sort
View
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
15 years 10 months ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak
CHI
2009
ACM
15 years 10 months ago
Supporting content and process common ground in computer-supported teamwork
We build on our prior work with computer-supported teams performing a complex decision-making task on maps, where the distinction between content and process common ground is prop...
Gregorio Convertino, Helena M. Mentis, Mary Beth R...
COMPGEOM
2009
ACM
15 years 10 months ago
k-means requires exponentially many iterations even in the plane
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
Andrea Vattani
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 10 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
CVPR
2000
IEEE
15 years 10 months ago
Provably Fast Algorithms for Contour Tracking
A new tracker is presented. Two sets are identified: one which contains all possible curves as found in the image, and a second which contains all curves which characterize the o...
Daniel Freedman, Michael S. Brandstein
« Prev « First page 1043 / 1255 Last » Next »