Sciweavers

11565 search results - page 2310 / 2313
» Computing Minimal Mappings
Sort
View
CIKM
2011
Springer
12 years 7 months ago
MTopS: scalable processing of continuous top-k multi-query workloads
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
Avani Shastri, Di Yang, Elke A. Rundensteiner, Mat...
ICC
2011
IEEE
201views Communications» more  ICC 2011»
12 years 6 months ago
Survivable Optical Grid Dimensioning: Anycast Routing with Server and Network Failure Protection
Abstract—Grids can efficiently deal with challenging computational and data processing tasks which cutting edge science is generating today. So-called e-Science grids cope with ...
Chris Develder, Jens Buysse, Ali Shaikh, Brigitte ...
ASPLOS
2012
ACM
12 years 2 months ago
DejaVu: accelerating resource allocation in virtualized environments
Effective resource management of virtualized environments is a challenging task. State-of-the-art management systems either rely on analytical models or evaluate resource allocati...
Nedeljko Vasic, Dejan M. Novakovic, Svetozar Miuci...
TASE
2012
IEEE
12 years 2 months ago
Discrete-Event Coordination Design for Distributed Agents
— This paper presents new results on the formal design of distributed coordinating agents in a discrete-event framework. In this framework, agents are modeled to be individually ...
Manh Tung Pham, Kiam Tian Seow
WSDM
2012
ACM
267views Data Mining» more  WSDM 2012»
12 years 2 months ago
Learning to rank with multi-aspect relevance for vertical search
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
Changsung Kang, Xuanhui Wang, Yi Chang, Belle L. T...
« Prev « First page 2310 / 2313 Last » Next »