Sciweavers

1489 search results - page 280 / 298
» Optimizing Feature Sets for Structured Data
Sort
View
POPL
2010
ACM
14 years 5 months ago
Continuity Analysis of Programs
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
Swarat Chaudhuri, Sumit Gulwani, Roberto Lublinerm...
SDM
2009
SIAM
251views Data Mining» more  SDM 2009»
14 years 4 months ago
High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic.
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
Alok N. Choudhary, Arifa Nisar, Waseem Ahmad, Wei-...
BTW
2009
Springer
132views Database» more  BTW 2009»
13 years 11 months ago
End-to-End Performance Monitoring of Databases in Distributed Environments
: This demonstration features the IBM DB2 Performance Expert for Linux, Unix and Windows, a high-end database monitoring tool that is capable of end-to-end monitoring in distribute...
Stefanie Scherzinger, H. Karn, T. Steinbach
ISVD
2007
IEEE
14 years 1 months ago
Two-dimensional line space Voronoi Diagram
Given a set of points called sites, the Voronoi diagram is a partition of the plane into sets of points having the same closest site. Several generalizations of the Voronoi diagra...
Stéphane Rivière, Dominique Schmitt
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 7 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...