Sciweavers

356 search results - page 53 / 72
» Revisiting the Paxos Algorithm
Sort
View
INFOCOM
2010
IEEE
13 years 5 months ago
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
Shouwen Lai, Binoy Ravindran
CINQ
2004
Springer
163views Database» more  CINQ 2004»
14 years 23 days ago
Frequent Itemset Discovery with SQL Using Universal Quantification
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Ralf Rantzau
QSIC
2003
IEEE
14 years 19 days ago
Generating Small Combinatorial Test Suites to Cover Input-Output Relationships
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...
Christine Cheng, Adrian Dumitrescu, Patrick J. Sch...
CGF
2008
227views more  CGF 2008»
13 years 7 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...
TMM
2008
112views more  TMM 2008»
13 years 7 months ago
Multimodal News Story Clustering With Pairwise Visual Near-Duplicate Constraint
Story clustering is a critical step for news retrieval, topic mining, and summarization. Nonetheless, the task remains highly challenging owing to the fact that news topics exhibit...
Xiao Wu, Chong-Wah Ngo, Alexander G. Hauptmann