Sciweavers

1272 search results - page 126 / 255
» The Set Cover with Pairs Problem
Sort
View
ICDM
2007
IEEE
148views Data Mining» more  ICDM 2007»
14 years 2 months ago
Sample Selection for Maximal Diversity
The problem of selecting a sample subset sufficient to preserve diversity arises in many applications. One example is in the design of recombinant inbred lines (RIL) for genetic a...
Feng Pan, Adam Roberts, Leonard McMillan, David Th...
ICCAD
2006
IEEE
104views Hardware» more  ICCAD 2006»
14 years 7 months ago
Fullwave volumetric Maxwell solver using conduction modes
We present a gridless method for solving the interior problem for a set of conductors in an homogeneous dielectric, at sufficiently high frequencies, valid for conductor lengths ...
Salvador Ortiz, Roberto Suaya
CPAIOR
2009
Springer
14 years 5 months ago
The Polytope of Context-Free Grammar Constraints
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Ro...
ICDCSW
2007
IEEE
14 years 5 months ago
Modeling Data Consistency in Wireless Sensor Networks
— With the rapid growth of wireless sensor systems deployment, data quality has become a critical issue to the success of these applications. In this paper, we first raise the d...
Kewei Sha, Weisong Shi
CPC
2006
110views more  CPC 2006»
13 years 10 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin