Sciweavers

12562 search results - page 2213 / 2513
» Distributed Xbean Applications
Sort
View
143
Voted
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
15 years 8 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
157
Voted
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 8 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 8 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
144
Voted
SIGMOD
2010
ACM
305views Database» more  SIGMOD 2010»
15 years 8 months ago
MoveMine: mining moving object databases
With the maturity of GPS, wireless, and Web technologies, increasing amounts of movement data collected from various moving objects, such as animals, vehicles, mobile devices, and...
Zhenhui Li, Ming Ji, Jae-Gil Lee, Lu An Tang, Yint...
SYSTOR
2010
ACM
15 years 8 months ago
On the DMA mapping problem in direct device assignment
I/O intensive workloads running in virtual machines can suffer massive performance degradation. Direct assignment of I/O devices to virtual machines is the best performing I/O vir...
Ben-Ami Yassour, Muli Ben-Yehuda, Orit Wasserman
« Prev « First page 2213 / 2513 Last » Next »