Sciweavers

194 search results - page 30 / 39
» Computing Roundness is Easy if the Set is Almost Round
Sort
View
126
Voted
PAKDD
2000
ACM
161views Data Mining» more  PAKDD 2000»
15 years 4 months ago
Adaptive Boosting for Spatial Functions with Unstable Driving Attributes
Combining multiple global models (e.g. back-propagation based neural networks) is an effective technique for improving classification accuracy by reducing a variance through manipu...
Aleksandar Lazarevic, Tim Fiez, Zoran Obradovic
ANOR
2004
116views more  ANOR 2004»
15 years 10 days ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
APPROX
2009
Springer
105views Algorithms» more  APPROX 2009»
14 years 10 months ago
Real-Time Message Routing and Scheduling
Abstract. Exchanging messages between nodes of a network (e.g., embedded computers) is a fundamental issue in real-time systems involving critical routing and scheduling decisions....
Ronald Koch, Britta Peis, Martin Skutella, Andreas...
ICDE
2012
IEEE
252views Database» more  ICDE 2012»
13 years 2 months ago
Fuzzy Joins Using MapReduce
—Fuzzy/similarity joins have been widely studied in the research community and extensively used in real-world applications. This paper proposes and evaluates several algorithms f...
Foto N. Afrati, Anish Das Sarma, David Menestrina,...
114
Voted
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
16 years 24 days 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ö...