Sciweavers

5221 search results - page 259 / 1045
» An On-line Problem Database
Sort
View
SIGMOD
2004
ACM
123views Database» more  SIGMOD 2004»
16 years 6 months ago
Automatic Categorization of Query Results
Exploratory ad-hoc queries could return too many answers ? a phenomenon commonly referred to as "information overload". In this paper, we propose to automatically catego...
Kaushik Chakrabarti, Surajit Chaudhuri, Seung-won ...
PODS
2008
ACM
153views Database» more  PODS 2008»
16 years 6 months ago
Approximation algorithms for co-clustering
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar
DEXAW
2008
IEEE
204views Database» more  DEXAW 2008»
16 years 1 months ago
Particle Swarm Optimization Using Adaptive Mutation
Two new variants of Particle Swarm Optimization (PSO) called AMPSO1 and AMPSO2 are proposed for global optimization problems. Both the algorithms use adaptive mutation using Beta ...
Millie Pant, Radha Thangaraj, Ajith Abraham
ICDE
2007
IEEE
123views Database» more  ICDE 2007»
16 years 28 days ago
Privacy Preserving Pattern Discovery in Distributed Time Series
The search for unknown frequent pattern is one of the core activities in many time series data mining processes. In this paper we present an extension of the pattern discovery pro...
Josenildo Costa da Silva, Matthias Klusch
ICDT
2003
ACM
126views Database» more  ICDT 2003»
15 years 11 months ago
Typechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
Wim Martens, Frank Neven