Sciweavers

8141 search results - page 1618 / 1629
» Higher Order Generalization
Sort
View
KCAP
2011
ACM
12 years 10 months ago
Eliciting hierarchical structures from enumerative structures for ontology learning
Some discourse structures such as enumerative structures have typographical, punctuational and laying out characteristics which (1) make them easily identifiable and (2) convey hi...
Mouna Kamel, Bernard Rothenburger
NETWORKS
2011
12 years 10 months ago
On terminal delta-wye reducibility of planar graphs
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
Isidoro Gitler, Feliu Sagols
PLDI
2011
ACM
12 years 10 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
GIS
2006
ACM
13 years 7 months ago
A peer-to-peer spatial cloaking algorithm for anonymous location-based service
This paper tackles a major privacy threat in current location-based services where users have to report their exact locations to the database server in order to obtain their desir...
Chi-Yin Chow, Mohamed F. Mokbel, Xuan Liu
SDM
2011
SIAM
218views Data Mining» more  SDM 2011»
12 years 10 months ago
Segmented nestedness in binary data
A binary matrix is fully nested if its columns form a chain of subsets; that is, any two columns are ordered by the subset relation, where we view each column as a subset of the r...
Esa Junttila, Petteri Kaski
« Prev « First page 1618 / 1629 Last » Next »