Sciweavers

2031 search results - page 399 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
OOPSLA
2004
Springer
14 years 3 months ago
Practical predicate dispatch
Predicate dispatch is an object-oriented (OO) language mechanism for determining the method implementation to be invoked upon a message send. With predicate dispatch, each method ...
Todd D. Millstein
VLDB
2004
ACM
99views Database» more  VLDB 2004»
14 years 3 months ago
Query Languages and Data Models for Database Sequences and Data Streams
We study the fundamental limitations of relational algebra (RA) and SQL in supporting sequence and stream queries, and present effective query language and data model enrichments ...
Yan-Nei Law, Haixun Wang, Carlo Zaniolo
IPPS
2003
IEEE
14 years 3 months ago
Approximate Search Engine Optimization for Directory Service
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
Kai-Hsiang Yang, Chi-Chien Pan, Tzao-Lin Lee
COMPGEOM
2003
ACM
14 years 3 months ago
Polygon decomposition based on the straight line skeleton
We propose a novel type of decomposition for polygonal shapes. It is thought that, for the task of object recognition, the human visual system uses a part-based representation. De...
Mirela Tanase, Remco C. Veltkamp
ISPD
2003
ACM
121views Hardware» more  ISPD 2003»
14 years 3 months ago
Optimality, scalability and stability study of partitioning and placement algorithms
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
Jason Cong, Michail Romesis, Min Xie