Sciweavers

13987 search results - page 2650 / 2798
» The Two Guards Problem
Sort
View
VLDB
2001
ACM
66views Database» more  VLDB 2001»
14 years 14 days ago
An Evaluation of Generic Bulk Loading Techniques
Bulk loading refers to the process of creating an index from scratch for a given data set. This problem is well understood for B-trees, but so far, non-traditional index structure...
Jochen Van den Bercken, Bernhard Seeger
WADS
2001
Springer
126views Algorithms» more  WADS 2001»
14 years 14 days ago
On External-Memory Planar Depth First Search
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
WIA
2001
Springer
14 years 14 days ago
Finite-State Transducer Cascade to Extract Proper Names in Texts
This article describes a finite-state cascade for the extraction of person names in texts in French. We extract these proper names in order to categorize and to cluster texts with...
Nathalie Friburger, Denis Maurel
CBMS
2000
IEEE
14 years 14 days ago
Use of Shape Models to Search Digitized Spine X-rays
We are building a biomedical information resource consisting of digitized x-ray images and associated textual data from national health surveys. This resource, the Web-based Medic...
L. Rodney Long, George R. Thoma
ICPP
2000
IEEE
14 years 13 days ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
« Prev « First page 2650 / 2798 Last » Next »