530 search results - page 66 / 106 » Practical Threshold Signatures |
AAAI
2010
15 years 2 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
112
Voted
TKDE
2008
15 years 12 days ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
139
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Opportunistic scheduling and routing can in principle greatly increase the throughput of decentralized wireless networks, but to be practical such algorithms must do so with small...
114
click to vote
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
—In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gat...
114
Voted
SIGSOFT
2009
ACM
15 years 7 months ago
2009
ACM
Web-services are broadly considered as an effective means to achieve interoperability between heterogeneous parties of a business process and offer an open platform for developing...