Sciweavers

6251 search results - page 1170 / 1251
» Randomness, Computability, and Density
Sort
View
ESA
2004
Springer
129views Algorithms» more  ESA 2004»
14 years 3 months ago
Contraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...
IPSN
2004
Springer
14 years 3 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
LCN
2003
IEEE
14 years 3 months ago
ReInForM: Reliable Information Forwarding Using Multiple Paths in Sensor Networks
Sensor networks are meant for sensing and disseminating information about the environment they sense. The criticality of a sensed phenomenon determines it’s importance to the en...
Budhaditya Deb, Sudeept Bhatnagar, Badri Nath
NDSS
2003
IEEE
14 years 3 months ago
Proactive Two-Party Signatures for User Authentication
We study proactive two-party signature schemes in the context of user authentication. A proactive two-party signature scheme (P2SS) allows two parties—the client and the serverâ...
Antonio Nicolosi, Maxwell N. Krohn, Yevgeniy Dodis...
SIGECOM
2003
ACM
141views ECommerce» more  SIGECOM 2003»
14 years 3 months ago
Automated mechanism design for a self-interested designer
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
Vincent Conitzer, Tuomas Sandholm
« Prev « First page 1170 / 1251 Last » Next »