Sciweavers

3428 search results - page 142 / 686
» Making the Case
Sort
View
ECCC
2008
122views more  ECCC 2008»
14 years 11 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira
81
Voted
ICALT
2007
IEEE
15 years 5 months ago
Towards a Canonical View of Peer Assessment
Peer Assessment (or Peer Review) is a popular form of reciprocal assessment where students produce feedback, or grades, for each others work. Peer Assessment activities can be ext...
David E. Millard, Karen Fill, Lester Gilbert, Yvon...
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
15 years 4 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
CVPR
1997
IEEE
16 years 1 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
ICFP
2006
ACM
15 years 11 months ago
Good advice for type-directed programming aspect-oriented programming and extensible generic functions
Type-directed programming is an important idiom for software design. In type-directed programming the behavior of programs is guided by the type structure of data. It makes it pos...
Geoffrey Washburn, Stephanie Weirich