Sciweavers

16257 search results - page 3213 / 3252
» D-finiteness: algorithms and applications
Sort
View
SIGECOM
2008
ACM
138views ECommerce» more  SIGECOM 2008»
13 years 9 months ago
Generalized scoring rules and the frequency of coalitional manipulability
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...
Lirong Xia, Vincent Conitzer
SIGECOM
2008
ACM
131views ECommerce» more  SIGECOM 2008»
13 years 9 months ago
Truthful germs are contagious: a local to global characterization of truthfulness
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
Aaron Archer, Robert Kleinberg
SIGIR
2008
ACM
13 years 9 months ago
A few examples go a long way: constructing query models from elaborate query formulations
We address a specific enterprise document search scenario, where the information need is expressed in an elaborate manner. In our scenario, information needs are expressed using a...
Krisztian Balog, Wouter Weerkamp, Maarten de Rijke
SAC
2006
ACM
13 years 9 months ago
Combining supervised and unsupervised monitoring for fault detection in distributed computing systems
Fast and accurate fault detection is becoming an essential component of management software for mission critical systems. A good fault detector makes possible to initiate repair a...
Haifeng Chen, Guofei Jiang, Cristian Ungureanu, Ke...
SMA
2008
ACM
150views Solid Modeling» more  SMA 2008»
13 years 9 months ago
Surface matching using consistent pants decomposition
Surface matching is fundamental to shape computing and various downstream applications. This paper develops a powerful pants decomposition framework for computing maps between sur...
Xin Li, Xianfeng Gu, Hong Qin
« Prev « First page 3213 / 3252 Last » Next »