Sciweavers

3360 search results - page 74 / 672
» Opportunistic Data Structures with Applications
Sort
View
131
Voted
HPDC
1998
IEEE
15 years 7 months ago
Efficient Coupling of Parallel Applications Using PAWS
PAWS (Parallel Application WorkSpace) is a software infrastructure for use in connecting separate parallel applications within a component-like model. A central PAWS Controller co...
Peter H. Beckman, Patricia K. Fasel, William F. Hu...
124
Voted
PEPM
1993
ACM
15 years 7 months ago
Polyvariant Binding-Time Analysis For Applicative Languages
Binding-time analysis is a crucial component of an ofine partial evaluator. The accuracy of the binding-time information that it produces determines the degree of specialization o...
Charles Consel
ICDM
2007
IEEE
162views Data Mining» more  ICDM 2007»
15 years 7 months ago
Exploiting Network Structure for Active Inference in Collective Classification
Active inference seeks to maximize classification performance while minimizing the amount of data that must be labeled ex ante. This task is particularly relevant in the context o...
Matthew J. Rattigan, Marc Maier, David Jensen, Bin...
SIGMOD
1996
ACM
84views Database» more  SIGMOD 1996»
15 years 7 months ago
Change Detection in Hierarchically Structured Information
Detecting and representing changes to data is important for active databases, data warehousing, view maintenance, and version and configuration management. Most previous work in c...
Sudarshan S. Chawathe, Anand Rajaraman, Hector Gar...
108
Voted
ICPR
2002
IEEE
15 years 8 months ago
Exploratory Analysis of Point Proximity in Subspaces
We consider clustering as computation of a structure of proximity relationships within a data set in a feature space or its subspaces. We propose a data structure to represent suc...
Tin Kam Ho