13500 search results - page 339 / 2700 » Improved analysis of D |
198
click to vote
IROS
2007
IEEE
16 years 1 months ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
163
click to vote
CBMS
2008
IEEE
16 years 1 months ago
2008
IEEE
Performance on an information gathering task is shown to be superior in teleconference. Analysis of errors in an exercise revealed the data sources used in co-located and teleconf...
186
click to vote
DEXAW
2007
IEEE
16 years 1 months ago
2007
IEEE
Hyperlink Structure is widely used in the hypertext classification, but it has not been paid enough attention. We propose a hyperlink classification approach to improve PageRank a...
139
click to vote
CRYPTO
2005
Springer
16 years 8 days ago
2005
Springer
We present an improved bound on the advantage of any q-query adversary at distinguishing between the CBC MAC over a random n-bit permutation and a random function outputting n bit...
176
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...