Sciweavers

37 search results - page 7 / 8
» Adaptive Lookahead for Answer Set Computation
Sort
View
BROADNETS
2006
IEEE
13 years 11 months ago
On the Use of Smart Antennas in Multi-Hop Wireless Networks
— Smart antennas include a broad range of antenna technologies ranging from the simple switched beam to the more sophisticated adaptive arrays and multiple input multiple output ...
Karthikeyan Sundaresan, Sriram Lakshmanan, Raghupa...
CORR
2007
Springer
127views Education» more  CORR 2007»
13 years 5 months ago
Attribute Exploration of Discrete Temporal Transitions
Discrete temporal transitions occur in a variety of domains, but this work is mainly motivated by applications in molecular biology: explaining and analyzing observed transcriptome...
Johannes Wollbold
SSD
2007
Springer
243views Database» more  SSD 2007»
13 years 11 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
CEC
2011
IEEE
12 years 5 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
SIAMMAX
2010
164views more  SIAMMAX 2010»
12 years 12 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu