Sciweavers

11214 search results - page 218 / 2243
» Just-in-time data structures
Sort
View
105
Voted
JSS
2008
139views more  JSS 2008»
15 years 20 days ago
Dynamic interval-based labeling scheme for efficient XML query and update processing
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationsh...
Jung-Hee Yun, Chin-Wan Chung
125
Voted
TKDE
2010
190views more  TKDE 2010»
14 years 11 months ago
Effectively Indexing the Uncertain Space
—With the rapid development of various optical, infrared, and radar sensors and GPS techniques, there are a huge amount of multidimensional uncertain data collected and accumulat...
Ying Zhang, Xuemin Lin, Wenjie Zhang, Jianmin Wang...
80
Voted
JSC
2002
74views more  JSC 2002»
15 years 11 days ago
Computing Transformation Semigroups
This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R-class in terms of...
Steve Linton, G. Pfeiffer, Edmund F. Robertson, Ni...
82
Voted
ENTCS
2006
112views more  ENTCS 2006»
15 years 21 days ago
Synchronous Dataflow Pattern Matching
We introduce variant types and a pattern matching operation to synchronous dataflow languages. These languages are used in the design of reactive systems. As these systems grow in...
Grégoire Hamon
DAGSTUHL
2009
15 years 1 months ago
Learning Highly Structured Manifolds: Harnessing the Power of SOMs
Abstract. In this paper we elaborate on the challenges of learning manifolds that have many relevant clusters, and where the clusters can have widely varying statistics. We call su...
Erzsébet Merényi, Kadim Tasdemir, Li...