Sciweavers

820 search results - page 79 / 164
» Finding low-utility data structures
Sort
View
HPCN
1999
Springer
14 years 1 months ago
VisualExpresso: Generating a Virtual Reality Internet
Finding knowledge from vast quantities of data is a difficult task, made simpler by visually representing this information. The Internet can be considered a vast (global) database,...
David Cleary, Diarmuid O'Donoghue
CCCG
2006
13 years 10 months ago
(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
For a given point set in Euclidean space we consider the problem of finding (approximate) nearest neighbors of a query point but restricting only to points that lie within a fixed...
Stefan Funke, Theocharis Malamatos, Domagoj Matije...
JMM2
2006
128views more  JMM2 2006»
13 years 8 months ago
Analysis of Facial Dynamics Using a Tensor Framework
Research has shown that the dynamics of facial motion are important in the perception of gender, identity, and emotion. In this paper we show that it is possible to use a multi-lin...
Lisa Gralewski, Neill W. Campbell, Edward Morrison...
ACL
2010
13 years 6 months ago
Experiments in Graph-Based Semi-Supervised Learning Methods for Class-Instance Acquisition
Graph-based semi-supervised learning (SSL) algorithms have been successfully used to extract class-instance pairs from large unstructured and structured text collections. However,...
Partha Pratim Talukdar, Fernando Pereira
TSE
2010
120views more  TSE 2010»
13 years 3 months ago
Efficient Software Verification: Statistical Testing Using Automated Search
Statistical testing has been shown to be more efficient at detecting faults in software than other methods of dynamic testing such as random and structural testing. Test data are g...
Simon M. Poulding, John A. Clark