Sciweavers

1731 search results - page 182 / 347
» Maximum likelihood analysis of algorithms and data structure...
Sort
View
ICDE
2009
IEEE
129views Database» more  ICDE 2009»
14 years 9 months ago
Computing Distance Histograms Efficiently in Scientific Databases
Abstract-- Particle simulation has become an important research tool in many scientific and engineering fields. Data generated by such simulations impose great challenges to databa...
Yi-Cheng Tu, Shaoping Chen, Sagar Pandit
CANDC
2000
ACM
13 years 8 months ago
Sequence Complexity for Biological Sequence Analysis
A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instance...
Lloyd Allison, Linda Stern, Timothy Edgoose, Trevo...
ADMA
2008
Springer
89views Data Mining» more  ADMA 2008»
13 years 10 months ago
Timeline Analysis of Web News Events
With a large number of news available on the internet everyday, it is an interesting work to automatically organize news events by time order and dependencies between events. The w...
Jiangtao Qiu, Chuan Li, Shaojie Qiao, Taiyong Li, ...
WWW
2006
ACM
14 years 8 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
SAC
2002
ACM
13 years 7 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...