Sciweavers

2254 search results - page 146 / 451
» Computing the minimal covering set
Sort
View
DEXA
2005
Springer
148views Database» more  DEXA 2005»
16 years 3 days ago
XG: A Data-Driven Computation Grid for Enterprise-Scale Mining
In this paper we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. We show how such an architecture can be le...
Radu Sion, Ramesh Natarajan, Inderpal Narang, Wen-...
JITECH
2007
136views more  JITECH 2007»
15 years 6 months ago
A computer scientist's reactions to NPfIT
This paper contains a set of personal views relating to NHS Connecting for Health’s National Programme for IT (NPfIT), and in particular its Care Records Service, written from t...
Brian Randell
RIVF
2008
15 years 8 months ago
Simple but effective methods for combining kernels in computational biology
Complex biological data generated from various experiments are stored in diverse data types in multiple datasets. By appropriately representing each biological dataset as a kernel ...
Hiroaki Tanabe, Tu Bao Ho, Canh Hao Nguyen, Saori ...
APIN
1998
132views more  APIN 1998»
15 years 6 months ago
Evolution-Based Methods for Selecting Point Data for Object Localization: Applications to Computer-Assisted Surgery
Object localization has applications in many areas of engineering and science. The goal is to spatially locate an arbitrarily-shaped object. In many applications, it is desirable ...
Shumeet Baluja, David Simon
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 10 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek