Sciweavers

1045 search results - page 169 / 209
» The Use of Exceptions
Sort
View
RECOMB
2006
Springer
14 years 8 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
SIGMOD
2007
ACM
167views Database» more  SIGMOD 2007»
14 years 8 months ago
Data currency in replicated DHTs
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 8 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
MOBISYS
2007
ACM
14 years 7 months ago
Context browsing with mobiles - when less is more
Except for a handful of "mobile" Web sites, the Web is designed for browsing with personal computers with large screens capable of fitting the content of most Web pages....
Yevgen Borodin, Jalal Mahmud, I. V. Ramakrishnan
PLDI
2010
ACM
14 years 5 months ago
Breadcrumbs: Efficient Context Sensitivity for Dynamic Bug Detection Analyses
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...
Michael D. Bond, Graham Z. Baker, Samuel Z. Guyer