Sciweavers

43264 search results - page 7953 / 8653
» Comparing models of computation
Sort
View
ICALP
2009
Springer
16 years 6 months ago
Learning Halfspaces with Malicious Noise
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
Adam R. Klivans, Philip M. Long, Rocco A. Servedio
ICALP
2009
Springer
16 years 6 months ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
16 years 6 months ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
PERCOM
2007
ACM
16 years 5 months ago
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real ...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
PERCOM
2005
ACM
16 years 5 months ago
TinyLIME: Bridging Mobile and Sensor Networks through Middleware
In the rapidly developing field of sensor networks, bridging the gap between the applications and the hardware presents a major challenge. Although middleware is one solution, it ...
Carlo Curino, Matteo Giani, Marco Giorgetta, Aless...
« Prev « First page 7953 / 8653 Last » Next »