Sciweavers

813 search results - page 82 / 163
» Efficient Processing of Updates in Dynamic XML Data
Sort
View
RR
2007
Springer
14 years 3 months ago
Efficiently Querying Relational Databases Using OWL and SWRL
For the foreseeable future, most data will continue to be stored in relational databases. To work with these data in ontology-based applications, tools and techniques that bridge t...
Martin J. O'Connor, Ravi Shankar, Samson W. Tu, Cs...
EDBTW
2010
Springer
14 years 15 days ago
Text-to-query: dynamically building structured analytics to illustrate textual content
Successfully structuring information in databases, OLAP cubes, and XML is a crucial element in managing data nowadays. However this process brought new challenges to usability. It...
Raphaël Thollot, Falk Brauer, Wojciech M. Bar...
ICIP
2005
IEEE
14 years 11 months ago
Predictive compression of dynamic 3D meshes
An efficient algorithm for compression of dynamic time-consistent 3D meshes is presented. Such a sequence of meshes contains a large degree of temporal statistical dependencies tha...
Aljoscha Smolic, Karsten Müller, Matthias Kau...
ESA
2008
Springer
99views Algorithms» more  ESA 2008»
13 years 11 months ago
Robust Kinetic Convex Hulls in 3D
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, ...
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 7 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu