Sciweavers

11862 search results - page 256 / 2373
» Relative information completeness
Sort
View
MICS
2008
63views more  MICS 2008»
15 years 4 months ago
Unambiguous Automata
We give a new presentation of two results concerning synchronized automata. The first one gives a linear bound on the synchronization delay of complete local automata. The second o...
Marie-Pierre Béal, Eugen Czeizler, Jarkko K...
LREC
2010
159views Education» more  LREC 2010»
15 years 5 months ago
Bootstrapping Language Neutral Term Extraction
A variety of methods exist for extracting terms and relations between terms from a corpus, each of them having strengths and weaknesses. Rather than just using the joint results, ...
Wauter Bosma, Piek Vossen
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
15 years 8 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
MST
2010
101views more  MST 2010»
15 years 2 months ago
Non-Uniform Reductions
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
Harry Buhrman, Benjamin J. Hescott, Steven Homer, ...
CIKM
2006
Springer
15 years 8 months ago
Mining compressed commodity workflows from massive RFID data sets
Radio Frequency Identification (RFID) technology is fast becoming a prevalent tool in tracking commodities in supply chain management applications. The movement of commodities thr...
Hector Gonzalez, Jiawei Han, Xiaolei Li