Sciweavers

1566 search results - page 274 / 314
» On a Cone Covering Problem
Sort
View
136
Voted
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 7 months ago
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhatt...
140
Voted
CORR
2008
Springer
131views Education» more  CORR 2008»
15 years 3 months ago
Jamming in Fixed-Rate Wireless Systems with Power Constraints - Part I: Fast Fading Channels
This is the first part of a two-part paper that studies the problem of jamming in a fixed-rate transmission system with fading, under the general assumption that the jammer has no...
George T. Amariucai, Shuangqing Wei
111
Voted
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 4 months ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen
158
Voted
ICALP
2009
Springer
16 years 4 months ago
Annotations in Data Streams
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
Amit Chakrabarti, Graham Cormode, Andrew McGregor
118
Voted
ICCAD
2001
IEEE
192views Hardware» more  ICCAD 2001»
16 years 18 days ago
BOOM - A Heuristic Boolean Minimizer
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
Jan Hlavicka, Petr Fiser