Sciweavers

1632 search results - page 135 / 327
» On special numberings of hypergraphs
Sort
View
STOC
2006
ACM
83views Algorithms» more  STOC 2006»
16 years 6 months ago
A randomized polynomial-time simplex algorithm for linear programming
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
Jonathan A. Kelner, Daniel A. Spielman
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
16 years 6 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...
EDBT
2004
ACM
172views Database» more  EDBT 2004»
16 years 6 months ago
Content-Based Routing of Path Queries in Peer-to-Peer Systems
Peer-to-peer (P2P) systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. In this paper, we consider the case in whic...
Georgia Koloniari, Evaggelia Pitoura
MOBIHOC
2001
ACM
16 years 6 months ago
Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
Seapahn Meguerdichian, Sasha Slijepcevic, Vahag Ka...
ALT
2000
Springer
16 years 3 months ago
Learning Recursive Concepts with Anomalies
This paper provides a systematic study of inductive inference of indexable concept classes in learning scenarios in which the learner is successful if its final hypothesis describ...
Gunter Grieser, Steffen Lange, Thomas Zeugmann