Sciweavers

962 search results - page 29 / 193
» Efficient Algorithms for Eulerian Extension
Sort
View
DAGSTUHL
2004
14 years 11 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
CORR
2010
Springer
132views Education» more  CORR 2010»
14 years 9 months ago
ETP-Mine: An Efficient Method for Mining Transitional Patterns
A Transaction database contains a set of transactions along with items and their associated timestamps. Transitional patterns are the patterns which specify the dynamic behavior o...
B. Kiran Kumar
83
Voted
TPDS
2008
126views more  TPDS 2008»
14 years 9 months ago
Efficient Directional Network Backbone Construction in Mobile Ad Hoc Networks
In this paper, we consider the issue of constructing an energy-efficient virtual network backbone in mobile ad hoc networks (MANETs) for broadcasting applications using directiona...
Shuhui Yang, Jie Wu, Fei Dai
ICIAR
2007
Springer
15 years 3 months ago
Efficient and Effective Ultrasound Image Analysis Scheme for Thyroid Nodule Detection
Ultrasound imaging of thyroid gland provides the ability to acquire valuable information for medical diagnosis. This study presents a novel scheme for the analysis of longitudinal ...
Eystratios G. Keramidas, Dimitrios K. Iakovidis, D...
AAAI
2008
15 years 19 hour ago
Multiagent Graph Coloring: Pareto Efficiency, Fairness and Individual Rationality
We consider a multiagent extension of single-agent graph coloring. Multiple agents hold disjoint autonomous subgraphs of a global graph, and every color used by the agents in colo...
Yaad Blum, Jeffrey S. Rosenschein