Sciweavers

1679 search results - page 136 / 336
» Strong order equivalence
Sort
View
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
14 years 10 months ago
De-duping URLs via rewrite rules
A large fraction of the URLs on the web contain duplicate (or near-duplicate) content. De-duping URLs is an extremely important problem for search engines, since all the principal...
Anirban Dasgupta, Ravi Kumar, Amit Sasturkar
ICFP
2003
ACM
14 years 10 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
BMCBI
2008
124views more  BMCBI 2008»
13 years 10 months ago
Alignment of protein structures in the presence of domain motions
Background: Structural alignment is an important step in protein comparison. Well-established methods exist for solving this problem under the assumption that the structures under...
Roberto Mosca, Barbara Brannetti, Thomas R. Schnei...
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 10 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný
DM
2000
108views more  DM 2000»
13 years 10 months ago
On completeness of word reversing
Word reversing is a combinatorial operation on words that detects pairs of equivalent words in monoids that admit a presentation of a certain form. Here we give conditions for this...
Patrick Dehornoy