Sciweavers

502 search results - page 15 / 101
» Verifying Balanced Trees
Sort
View
CONCUR
2000
Springer
14 years 2 months ago
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
CVPR
2007
IEEE
14 years 12 months ago
Using Segmentation to Verify Object Hypotheses
We present an approach for object recognition that combines detection and segmentation within a efficient hypothesize/test framework. Scanning-window template classifiers are the ...
Deva Ramanan
INFOCOM
2010
IEEE
13 years 8 months ago
A Balanced Consistency Maintenance Protocol for Structured P2P Systems
—A fundamental challenge of managing mutable data replication in a Peer-to-Peer (P2P) system is how to efficiently maintain consistency under various sharing patterns with heter...
Yi Hu, Min Feng, Laxmi N. Bhuyan
ADHOCNETS
2010
Springer
13 years 7 months ago
Balanced Itinerary Planning for Multiple Mobile Agents in Wireless Sensor Networks
In this paper, we consider the use of multiple mobile software agents to perform different tasks in wireless sensor networks (WSNs). To this regard, determining the number of mobil...
Min Chen, Wei Cai, Sergio González-Valenzue...
KDD
1995
ACM
140views Data Mining» more  KDD 1995»
14 years 1 months ago
Decision Tree Induction: How Effective is the Greedy Heuristic?
Mostexisting decision tree systemsuse a greedyapproachto inducetrees -- locally optimalsplits are inducedat every node of the tree. Althoughthe greedy approachis suboptimal,it is ...
Sreerama K. Murthy, Steven Salzberg