Sciweavers

920 search results - page 52 / 184
» Computing the Frequency of Partial Orders
Sort
View
IANDC
2008
141views more  IANDC 2008»
13 years 10 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
CGF
2005
109views more  CGF 2005»
13 years 10 months ago
GeoFilter: Geometric Selection of Mesh Filter Parameters
When designing a lowpass filter to eliminate noise in a triangle mesh, the cutoff frequency is typically chosen by a cumbersome trial-and-error process. Therefore, it is important...
ByungMoon Kim, Jarek Rossignac
KDD
2003
ACM
99views Data Mining» more  KDD 2003»
14 years 10 months ago
Fragments of order
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
Aristides Gionis, Teija Kujala, Heikki Mannila
LICS
2009
IEEE
14 years 4 months ago
The Structure of First-Order Causality
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
Samuel Mimram
PODS
2004
ACM
158views Database» more  PODS 2004»
14 years 10 months ago
Composing Schema Mappings: Second-Order Dependencies to the Rescue
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...