Sciweavers

6142 search results - page 1227 / 1229
» The Complexity of Partition Functions
Sort
View
TKDE
2012
253views Formal Methods» more  TKDE 2012»
13 years 13 hour ago
Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis
—Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns....
Carlos Ordonez, Zhibo Chen 0002
EDBT
2012
ACM
395views Database» more  EDBT 2012»
13 years 10 hour ago
Data management with SAPs in-memory computing engine
We present some architectural and technological insights on SAP’s HANA database and derive research challenges for future enterprise application development. The HANA database m...
Joos-Hendrik Boese, Cafer Tosun, Christian Mathis,...
BIOINFORMATICS
2012
13 years 8 hour ago
Epigenetic priors for identifying active transcription factor binding sites
Motivation Accurate knowledge of the genome-wide binding of transcription factors in a particular cell type or under a particular condition is necessary for understanding transcri...
Gabriel Cuellar-Partida, Fabian A. Buske, Robert C...
CVPR
2006
IEEE
15 years 11 months ago
Acceleration Strategies for Gaussian Mean-Shift Image Segmentation
Gaussian mean-shift (GMS) is a clustering algorithm that has been shown to produce good image segmentations (where each pixel is represented as a feature vector with spatial and r...
Miguel Á. Carreira-Perpiñán
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
15 years 10 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
« Prev « First page 1227 / 1229 Last » Next »