Sciweavers

649 search results - page 119 / 130
» Improved and Optimized Partitioning Techniques in Database Q...
Sort
View
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
15 years 12 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
DAWAK
2009
Springer
14 years 9 months ago
BitCube: A Bottom-Up Cubing Engineering
Enhancing on line analytical processing through efficient cube computation plays a key role in Data Warehouse management. Hashing, grouping and mining techniques are commonly used ...
Alfredo Ferro, Rosalba Giugno, Piera Laura Puglisi...
OOPSLA
2007
Springer
15 years 5 months ago
Scalable omniscient debugging
Omniscient debuggers make it possible to navigate backwards in time within a program execution trace, drastically improving the task of debugging complex applications. Still, they...
Guillaume Pothier, Éric Tanter, José...
DEXA
2004
Springer
108views Database» more  DEXA 2004»
15 years 5 months ago
Towards Context-Aware Data Management for Ambient Intelligence
Ambient Intelligence (AmI) is a vision of future Information Society, where people are surrounded by an electronic environment which is sensitive to their needs, personalized to th...
Ling Feng, Peter M. G. Apers, Willem Jonker
CIKM
2010
Springer
14 years 10 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...