Sciweavers

740 search results - page 127 / 148
» Lower bounds for Buchsbaum* complexes
Sort
View
ALT
2002
Springer
16 years 3 months ago
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
Dmitry Gavinsky
INFOCOM
2009
IEEE
16 years 24 days ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
16 years 22 days ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
16 years 20 days ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
IPPS
2007
IEEE
16 years 13 days ago
A Comparative Study of Parallel Metaheuristics for Protein Structure Prediction on the Computational Grid
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
Alexandru-Adrian Tantar, Nouredine Melab, El-Ghaza...