Sciweavers

2496 search results - page 479 / 500
» On covering by translates of a set
Sort
View
132
Voted
ICCAD
2002
IEEE
142views Hardware» more  ICCAD 2002»
15 years 10 months ago
SAT and ATPG: Boolean engines for formal hardware verification
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
Armin Biere, Wolfgang Kunz
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
15 years 8 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
SAC
2009
ACM
15 years 8 months ago
Static type inference for Ruby
Many general-purpose, object-oriented scripting languages are dynamically typed, to keep the language flexible and not reject any programs unnecessarily. However, dynamic typing ...
Michael Furr, Jong-hoon (David) An, Jeffrey S. Fos...
128
Voted
MIR
2010
ACM
264views Multimedia» more  MIR 2010»
15 years 8 months ago
Quest for relevant tags using local interaction networks and visual content
Typical tag recommendation systems for photos shared on social networks such as Flickr, use visual content analysis, collaborative filtering or personalization strategies to prod...
Neela Sawant, Ritendra Datta, Jia Li, James Ze Wan...
LICS
2008
IEEE
15 years 8 months ago
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
Søren Riis