Sciweavers

2192 search results - page 160 / 439
» Algorithms for Challenging Motif Problems
Sort
View
154
Voted
SDM
2007
SIAM
107views Data Mining» more  SDM 2007»
15 years 6 months ago
On Demand Phenotype Ranking through Subspace Clustering
High throughput biotechnologies have enabled scientists to collect a large number of genetic and phenotypic attributes for a large collection of samples. Computational methods are...
Xiang Zhang, Wei Wang 0010, Jun Huan
WSCG
2003
142views more  WSCG 2003»
15 years 5 months ago
Dynamic Radiosity using Higher Order Functions Bases and Temporal Coherence
The computation of global illumination in a dynamic scene constitutes a real challenge in computer graphics. In radiosity algorithms, this problem is far from being easy, especial...
Venceslas Biri, Sylvain Michelin, Didier Arqu&egra...
PVLDB
2008
136views more  PVLDB 2008»
15 years 4 months ago
Keyword query cleaning
Unlike traditional database queries, keyword queries do not adhere to predefined syntax and are often dirty with irrelevant words from natural languages. This makes accurate and e...
Ken Q. Pu, Xiaohui Yu
150
Voted
SCHOLARPEDIA
2011
14 years 7 months ago
N-body simulations
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
KDD
2012
ACM
257views Data Mining» more  KDD 2012»
13 years 7 months ago
Aggregating web offers to determine product prices
Historical prices are important information that can help consumers decide whether the time is right to buy a product. They provide both a context to the users, and facilitate the...
Rakesh Agrawal, Samuel Ieong