Sciweavers

1995 search results - page 331 / 399
» What's the Problem
Sort
View
136
Voted
INFOVIS
1995
IEEE
15 years 7 months ago
The information mural: a technique for displaying and navigating large information spaces
Visualizations which depict entire information spaces provide context for navigation and browsing tasks; however, the limited size of the display screen makes creating effective g...
Dean F. Jerding, John T. Stasko
151
Voted
JACM
2006
134views more  JACM 2006»
15 years 3 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
123
Voted
JSC
2010
155views more  JSC 2010»
15 years 2 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
CVPR
2006
IEEE
16 years 5 months ago
Joint Boosting Feature Selection for Robust Face Recognition
A fundamental challenge in face recognition lies in determining what facial features are important for the identification of faces. In this paper, a novel face recognition framewo...
Rong Xiao, Wu-Jun Li, Yuandong Tian, Xiaoou Tang
134
Voted
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
16 years 4 months ago
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
Yehuda Lindell, Hila Zarosim