Sciweavers

4047 search results - page 295 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
ICDM
2003
IEEE
113views Data Mining» more  ICDM 2003»
15 years 11 months ago
Semantic Role Parsing: Adding Semantic Structure to Unstructured Text
There is a ever-growing need to add structure in the form of semantic markup to the huge amounts of unstructured text data now available. We present the technique of shallow seman...
Sameer Pradhan, Kadri Hacioglu, Wayne Ward, James ...
COCO
2001
Springer
142views Algorithms» more  COCO 2001»
15 years 11 months ago
On the Complexity of Approximating the VC Dimension
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
Elchanan Mossel, Christopher Umans
GROUP
1999
ACM
15 years 11 months ago
Building bridges: customisation and mutual intelligibility in shared category management
Research into collaborative document use often concentrates on how people share document content. However, studies of real-world document practices reveal that the structures by w...
Paul Dourish, John Lamping, Tom Rodden
AMW
2009
15 years 7 months ago
Semantic Integrity Constraints for Spatial Databases
Abstract. This paper introduces a formalization of a set of spatial semantic integrity constraints on an extended-relational database model. The formalization extends traditional n...
Loreto Bravo, M. Andrea Rodríguez
DM
2002
91views more  DM 2002»
15 years 6 months ago
A disproof of Henning's conjecture on irredundance perfect graphs
Let ir(G) and (G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = (H), for every induced subgr...
Lutz Volkmann, Vadim E. Zverovich