Sciweavers

157 search results - page 17 / 32
» A reduction of the NF consistency problem
Sort
View
ACL
2011
14 years 1 months ago
Event Discovery in Social Media Feeds
We present a novel method for record extraction from social streams such as Twitter. Unlike typical extraction setups, these environments are characterized by short, one sentence ...
Edward Benson, Aria Haghighi, Regina Barzilay
FOCS
2008
IEEE
15 years 4 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
15 years 10 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
COMCOM
2004
78views more  COMCOM 2004»
14 years 9 months ago
Wavelength assignment to lightpaths for minimal wavelength conversions in multihop WDM networks
In multihop wavelength division multiplexing systems, a connection between two communication nodes consists of one or more lightpaths. A wavelength conversion is required at the j...
Xiaohua Jia, David Hongwei Du, Xiao-Dong Hu, Deyin...
DAC
2009
ACM
15 years 10 months ago
ILP-based pin-count aware design methodology for microfluidic biochips
Digital microfluidic biochips have emerged as a popular alternative for laboratory experiments. To make the biochip feasible for practical applications, pin-count reduction is a k...
Cliff Chiung-Yu Lin, Yao-Wen Chang