8695 search results - page 130 / 1739 » Making the Complex Simple |
110
Voted
CG
2006
Springer
15 years 24 days ago
2006
Springer
In most previous NPR line rendering systems, geometric properties have been directly used to extract and stylize certain edges. However, this approach is bound to a tight stylizat...
127
Voted
CN
2006
15 years 24 days ago
2006
As buffer-less crossbar scheduling algorithms reach their practical limitations due to higher port numbers and data rates, internally buffered crossbar (IBC) switches have gained ...
193
Voted
SIGMOD
2009
ACM
16 years 1 months ago
2009
ACM
The query models of the recent generation of very large scale distributed (VLSD) shared-nothing data storage systems, including our own PNUTS and others (e.g. BigTable, Dynamo, Ca...
113
Voted
AAAI
1990
15 years 1 months ago
1990
This paper provides an account of the representation of defaults in Cyc and their semantics in terms of first order logic with reification. Default reasoning is a complex thing, a...
130
click to vote
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...