Sciweavers

364 search results - page 67 / 73
» Dimension Characterizations of Complexity Classes
Sort
View
TALG
2010
158views more  TALG 2010»
13 years 2 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
ATAL
2009
Springer
14 years 1 months ago
False name manipulations in weighted voting games: splitting, merging and annexation
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
Haris Aziz, Mike Paterson
HICSS
2003
IEEE
215views Biometrics» more  HICSS 2003»
14 years 18 days ago
A Field Study of Use of Synchronous Chat in Online Courses
A field study of Computer Mediated Communication (CMC) as used in higher education asks the questions, "Will students take part in synchronous chat sessions if they are sched...
David H. Spencer, Starr Roxanne Hiltz
ISAAC
2003
Springer
133views Algorithms» more  ISAAC 2003»
14 years 15 days ago
The Intractability of Computing the Hamming Distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
Bodo Manthey, Rüdiger Reischuk
ICCV
2009
IEEE
15 years 9 days ago
Multiple Kernels for Object Detection
Our objective is to obtain a state-of-the art object category detector by employing a state-of-the-art image classifier to search for the object in all possible image subwindows....
Andrea Vedaldi, Varun Gulshan, Manik Varma, Andrew...