Sciweavers

820 search results - page 51 / 164
» Finding low-utility data structures
Sort
View
CGI
2003
IEEE
14 years 11 days ago
Reaching Volumes Generated by Means of Octal Trees and Cartesian Constraints
This paper presents a system to analyze the reachability of the human body. The inverse kinematics technique is employed to find which regions of space are reachable using a certa...
I. Rodríguez, Manuel Peinado, Ronan Boulic,...
WDAG
2010
Springer
216views Algorithms» more  WDAG 2010»
13 years 6 months ago
A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware
The imminent arrival of best-effort transactional hardware has spurred new interest in the construction of nonblocking data structures, such as those that require atomic updates to...
Francois Carouge, Michael F. Spear
BMCBI
2004
126views more  BMCBI 2004»
13 years 8 months ago
A probabilistic model for the evolution of RNA structure
Background: For the purposes of finding and aligning noncoding RNA gene- and cis-regulatory elements in multiple-genome datasets, it is useful to be able to derive multi-sequence ...
Ian Holmes
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 9 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
WWW
2007
ACM
14 years 9 months ago
Towards efficient dominant relationship exploration of the product items on the web
In recent years, there has been a prevalence of search engines being employed to find useful information in the Web as they efficiently explore hyperlinks between web pages which ...
Zhenglu Yang, Lin Li, Botao Wang, Masaru Kitsurega...