Sciweavers

4137 search results - page 577 / 828
» On the number of matchings of a tree
Sort
View
OOPSLA
2005
Springer
14 years 1 months ago
Finding application errors and security flaws using PQL: a program query language
A number of effective error detection tools have been built in recent years to check if a program conforms to certain design rules. An important class of design rules deals with s...
Michael C. Martin, V. Benjamin Livshits, Monica S....
COMPGEOM
2004
ACM
14 years 1 months ago
Single-strip triangulation of manifolds with arbitrary topology
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
David Eppstein, M. Gopi
SSDBM
2010
IEEE
117views Database» more  SSDBM 2010»
14 years 1 months ago
Finding Top-k Similar Pairs of Objects Annotated with Terms from an Ontology
With the growing focus on semantic searches and interpretations, an increasing number of standardized vocabularies and ontologies are being designed and used to describe data. We ...
Arnab Bhattacharya, Abhishek Bhowmick, Ambuj K. Si...
CCS
2009
ACM
14 years 9 days ago
On lightweight mobile phone application certification
Users have begun downloading an increasingly large number of mobile phone applications in response to advancements in handsets and wireless networks. The increased number of appli...
William Enck, Machigar Ongtang, Patrick Drew McDan...
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 10 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals