Sciweavers

3394 search results - page 639 / 679
» Regular Object Types
Sort
View
105
Voted
SIGMOD
2004
ACM
156views Database» more  SIGMOD 2004»
16 years 22 days ago
Tree Logical Classes for Efficient Evaluation of XQuery
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
Stelios Paparizos, Yuqing Wu, Laks V. S. Lakshmana...
CIVR
2009
Springer
583views Image Analysis» more  CIVR 2009»
16 years 19 days ago
Mining from Large Image Sets
So far, most image mining was based on interactive querying. Although such querying will remain important in the future, several applications need image mining at such wide scale...
Luc J. Van Gool, Michael D. Breitenstein, Stephan ...
120
Voted
ICFP
2008
ACM
16 years 16 days ago
Transactional events for ML
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of Concurrent ML (CML) with a combinator that allows ...
Laura Effinger-Dean, Matthew Kehrt, Dan Grossman
82
Voted
ICFP
2008
ACM
16 years 16 days ago
Efficient nondestructive equality checking for trees and graphs
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
Michael D. Adams, R. Kent Dybvig
102
Voted
ICDE
2010
IEEE
568views Database» more  ICDE 2010»
16 years 10 days ago
Reverse Top-k Queries
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...