4781 search results - page 294 / 957 » Complexity at large |
131
click to vote
VLDB
1991
ACM
15 years 7 months ago
1991
ACM
A model capturing the data manipulation capabilities of a large class of methods in ohjectoriented databases is proposed and investsigated. The model uses a deterministic, paralle...
161
click to vote
3DIM
2005
IEEE
15 years 6 months ago
2005
IEEE
A registration method is proposed for 3D reconstruction of an indoor environment using a multi-view camera. In general, previous methods have a high computational complexity and a...
168
click to vote
CASCON
2008
15 years 5 months ago
2008
Databases are growing rapidly in scale and complexity. High performance, availability, and further service level agreements need to be satisfied under any circumstances to please ...
131
Voted
CSC
2008
15 years 5 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
108
click to vote
NAACL
2007
15 years 5 months ago
2007
Relation extraction is the task of finding semantic relations between entities from text. The state-of-the-art methods for relation extraction are mostly based on statistical lea...