Sciweavers

9284 search results - page 1515 / 1857
» Knowledge State Algorithms
Sort
View
ADVIS
2004
Springer
16 years 2 days ago
Incremental Association Rule Mining Using Materialized Data Mining Views
Data mining is an interactive and iterative process. Users issue series of similar queries until they receive satisfying results, yet currently available data mining systems do not...
Mikolaj Morzy, Tadeusz Morzy, Zbyszko Króli...
INFOCOM
2003
IEEE
15 years 12 months ago
Uplink Scheduling in CDMA Packet-Data Systems
Abstract—Uplink scheduling in wireless systems is gaining importance due to arising uplink intensive data services (ftp, image uploads etc.), which could be hampered by the curre...
Krishnan Kumaran, Lijun Qian
ISPD
2003
ACM
133views Hardware» more  ISPD 2003»
15 years 12 months ago
Optimal minimum-delay/area zero-skew clock tree wire-sizing in pseudo-polynomial time
In 21st-Century VLSI design, clocking plays crucial roles for both performance and timing convergence. Due to their non-convex nature, optimal minimum-delay/area zero-skew wire-si...
Jeng-Liang Tsai, Tsung-Hao Chen, Charlie Chung-Pin...
207
Voted
INFOCOM
2002
IEEE
15 years 11 months ago
Optimal Configuration of OSPF Aggregates
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalak...
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 11 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
« Prev « First page 1515 / 1857 Last » Next »