Sciweavers

29082 search results - page 5471 / 5817
» The Time-Triggered Model of Computation
Sort
View
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
16 years 7 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
16 years 7 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
ICALP
2009
Springer
16 years 7 months ago
Sorting and Selection with Imprecise Comparisons
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...
Avinatan Hassidim, Jelani Nelson, Miklós Aj...
SIGMOD
2008
ACM
107views Database» more  SIGMOD 2008»
16 years 7 months ago
Outlier-robust clustering using independent components
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
Christian Böhm, Christos Faloutsos, Claudia P...
SIGMOD
2006
ACM
145views Database» more  SIGMOD 2006»
16 years 7 months ago
Automatic client-server partitioning of data-driven web applications
Current application development tools provide completely different programming models for the application server (e.g., Java and J2EE) and the client web browser (e.g., JavaScript...
Nicholas Gerner, Fan Yang 0002, Alan J. Demers, Jo...
« Prev « First page 5471 / 5817 Last » Next »