Sciweavers

2272 search results - page 147 / 455
» Capture Complexity by Partition
Sort
View
ICML
2005
IEEE
16 years 4 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
107
Voted
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
16 years 3 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
OSDI
2008
ACM
16 years 3 months ago
An Internet Protocol Address Clustering Algorithm
We pose partitioning a b-bit Internet Protocol (IP) address space as a supervised learning task. Given (IP, property) labeled training data, we develop an IP-specific clustering a...
Robert Beverly, Karen R. Sollins
96
Voted
ICCD
2003
IEEE
147views Hardware» more  ICCD 2003»
16 years 3 days ago
An Efficient VLIW DSP Architecture for Baseband Processing
The VLIW processors with static instruction scheduling and thus deterministic execution times are very suitable for highperformance real-time DSP applications. But the two major w...
Tay-Jyi Lin, Chin-Chi Chang, Chen-Chia Lee, Chein-...
DATE
2009
IEEE
149views Hardware» more  DATE 2009»
15 years 10 months ago
An ILP formulation for task mapping and scheduling on multi-core architectures
Multi-core architectures are increasingly being adopted in the design of emerging complex embedded systems. Key issues of designing such systems are on-chip interconnects, memory a...
Ying Yi, Wei Han, Xin Zhao, Ahmet T. Erdogan, Tugh...