Sciweavers

1508 search results - page 58 / 302
» Efficient Path Profiling
Sort
View
ICML
2007
IEEE
16 years 20 days ago
Entire regularization paths for graph data
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda
RAS
2002
112views more  RAS 2002»
14 years 11 months ago
Avoiding self-occlusions and preserving visibility by path planning in the image
In this paper, we address the problem of generating trajectories of some image features in order to control efficiently a robotic system using an image-based control strategy. Firs...
Youcef Mezouar, François Chaumette
ICMCS
2009
IEEE
130views Multimedia» more  ICMCS 2009»
14 years 9 months ago
DVBMN-l: delay variation bounded multicast network with multiple paths
Distributed Multi-party/Multi-stream systems require a multicast subnetwork capable of satisfying QoS constraints such as Delay and Delay Variation Bound so that the messages reac...
Abhishek Bhattacharya, Zhenyu Yang
TALG
2008
100views more  TALG 2008»
14 years 11 months ago
Thin heaps, thick heaps
The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra's shortest path algorithm. Although asyptotically efficient, it is not as fast in...
Haim Kaplan, Robert Endre Tarjan
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
16 years 1 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...