Sciweavers

441 search results - page 81 / 89
» On the Extension of UML with Use Case Maps Concepts
Sort
View
MST
2000
86views more  MST 2000»
13 years 7 months ago
Team Learning of Computable Languages
A team of learning machines is a multiset of learning machines. A team is said to successfully learn a concept just in case each member of some nonempty subset, of predetermined s...
Sanjay Jain, Arun Sharma
SIAMCOMP
1998
118views more  SIAMCOMP 1998»
13 years 7 months ago
Genericity, Randomness, and Polynomial-Time Approximations
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
Yongge Wang
CIKM
2010
Springer
13 years 6 months ago
Building re-usable dictionary repositories for real-world text mining
Text mining, though still a nascent industry, has been growing quickly along with the awareness of the importance of unstructured data in business analytics, customer retention an...
Shantanu Godbole, Indrajit Bhattacharya, Ajay Gupt...
COMPGEOM
2006
ACM
14 years 1 months ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir
PODS
2010
ACM
242views Database» more  PODS 2010»
14 years 24 days ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak