Sciweavers

398 search results - page 60 / 80
» A new biclustering technique based on crossing minimization
Sort
View
WINET
2011
14 years 7 months ago
High performance, low complexity cooperative caching for wireless sensor networks
During the last decade, Wireless Sensor Networks (WSNs) have emerged and matured at such point that currently support several applications like environment control, intelligent bu...
Nikos Dimokas, Dimitrios Katsaros, Leandros Tassiu...
130
Voted
IS
2006
15 years 10 days ago
Processing approximate aggregate queries in wireless sensor networks
In-network data aggregation has been recently proposed as an effective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an a...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
79
Voted
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
16 years 29 days ago
Multiple intents re-ranking
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
Yossi Azar, Iftah Gamzu, Xiaoxin Yin
CVPR
2006
IEEE
16 years 2 months ago
Stereo Matching with Symmetric Cost Functions
Recently, many global stereo methods have achieved good results by modeling a disparity surface as a Markov random field (MRF) and by solving an optimization problem with various ...
Kuk-Jin Yoon, In-So Kweon
ICDE
2006
IEEE
150views Database» more  ICDE 2006»
16 years 1 months ago
Efficient Aggregation of Ranked Inputs
A top-k query combines different rankings of the same set of objects and returns the k objects with the highest combined score according to an aggregate function. We bring to ligh...
Nikos Mamoulis, Kit Hung Cheng, Man Lung Yiu, Davi...