Sciweavers

3444 search results - page 629 / 689
» A Theory of Object-Oriented Design
Sort
View
KDD
2003
ACM
161views Data Mining» more  KDD 2003»
14 years 9 months ago
Eliminating noisy information in Web pages for data mining
A commercial Web page typically contains many information blocks. Apart from the main content blocks, it usually has such blocks as navigation panels, copyright and privacy notice...
Lan Yi, Bing Liu, Xiaoli Li
CHI
2005
ACM
14 years 9 months ago
Work coordination, workflow, and workarounds in a medical context
In this paper we report an ethnographic study of workarounds--informal temporary practices for handling exceptions to normal workflow--in a hospital environment. Workarounds are a...
Marina Kobayashi, Susan R. Fussell, Yan Xiao, F. J...
CADE
2005
Springer
14 years 9 months ago
Reflecting Proofs in First-Order Logic with Equality
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
Evelyne Contejean, Pierre Corbineau
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
14 years 9 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
14 years 9 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb