Sciweavers

228 search results - page 42 / 46
» Relational queries over interpreted structures
Sort
View
76
Voted
ECCC
2007
86views more  ECCC 2007»
14 years 11 months ago
Testing Halfspaces
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, R...
SIGKDD
2000
106views more  SIGKDD 2000»
14 years 11 months ago
Data mining for hypertext: A tutorial survey
With over 800 million pages covering most areas of human endeavor, the World-wide Web is a fertile ground for data mining research to make a di erence to the e ectiveness of infor...
Soumen Chakrabarti
98
Voted
FOSSACS
2003
Springer
15 years 4 months ago
A Game Semantics for Generic Polymorphism
Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe th...
Samson Abramsky, Radha Jagadeesan
95
Voted
ICSE
2001
IEEE-ACM
15 years 4 months ago
The Coming-of-Age of Software Architecture Research
Over the past decade, software architecture research has emerged as the principled study of the overall structure of software systems, especially the relations among subsystems an...
Mary M. Shaw
UAI
2003
15 years 1 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...