Sciweavers

1060 search results - page 169 / 212
» On the Discovery of Random Trees
Sort
View
80
Voted
FUIN
2006
139views more  FUIN 2006»
14 years 10 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
CORR
2002
Springer
95views Education» more  CORR 2002»
14 years 10 months ago
Qualitative Visualization of Distance Information
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
Jobst Heitzig
PVLDB
2010
200views more  PVLDB 2010»
14 years 8 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
SSS
2010
Springer
134views Control Systems» more  SSS 2010»
14 years 8 months ago
Storage Capacity of Labeled Graphs
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang C...
ICRA
2010
IEEE
179views Robotics» more  ICRA 2010»
14 years 8 months ago
Needle path planning for digital breast tomosynthesis biopsy
This paper presents a new needle path planning method for digital breast tomosynthesis biopsy. Needle insertion planning into deformable tissue for breast biopsy procedure is a cha...
Laurence Vancamberg, Anis Sahbani, Serge Muller, G...