Sciweavers

870 search results - page 15 / 174
» Theoretical and experimental results on the goal-plan tree p...
Sort
View
CSE
2008
IEEE
14 years 1 months ago
An Experimental Peer-to-Peer E-mail System
Conventional e-mail systems are prone to problems that affect their dependability. E-mail systems operate following a “push-based” approach: the sender side server pushes the ...
Edson Kageyama, Carlos Maziero, Altair Olivo Santi...
SIGMOD
1999
ACM
87views Database» more  SIGMOD 1999»
13 years 11 months ago
On Random Sampling over Joins
A major bottleneck in implementing sampling as a primitive relational operation is the ine ciency ofsampling the output of a query. It is not even known whether it is possible to ...
Surajit Chaudhuri, Rajeev Motwani, Vivek R. Narasa...
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
14 years 9 days ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
CSB
2005
IEEE
152views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Consensus Genetic Maps: A Graph Theoretic Approach
A genetic map is an ordering of genetic markers constructed from genetic linkage data for use in linkage studies and experimental design. While traditional methods have focused on...
Benjamin G. Jackson, Srinivas Aluru, Patrick S. Sc...
WG
2009
Springer
14 years 2 months ago
Exact and Parameterized Algorithms for Max Internal Spanning Tree
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
Henning Fernau, Serge Gaspers, Daniel Raible