Sciweavers

1046 search results - page 198 / 210
» Approximation Algorithms for Domination Search
Sort
View
PSIVT
2007
Springer
110views Multimedia» more  PSIVT 2007»
14 years 1 months ago
Measuring Linearity of Ordered Point Sets
It is often practical to measure how linear a certain ordered set of points is. We are interested in linearity measures which are invariant to rotation, scaling, and translation. T...
Milos Stojmenovic, Amiya Nayak
SIGMOD
2011
ACM
276views Database» more  SIGMOD 2011»
12 years 10 months ago
Schedule optimization for data processing flows on the cloud
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
Herald Kllapi, Eva Sitaridi, Manolis M. Tsangaris,...
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
14 years 7 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
CIKM
2007
Springer
14 years 1 months ago
Hybrid results merging
The problem of results merging in distributed information retrieval environments has been approached by two different directions in research. Estimation approaches attempt to cal...
Georgios Paltoglou, Michail Salampasis, Maria Satr...
ALMOB
2008
95views more  ALMOB 2008»
13 years 7 months ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen