Sciweavers

243 search results - page 17 / 49
» Drawing Borders Efficiently
Sort
View
DATESO
2009
119views Database» more  DATESO 2009»
13 years 5 months ago
Efficiency Improvement of Narrow Range Query Processing in R-tree
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
Peter Chovanec, Michal Krátký
ICPR
2004
IEEE
14 years 8 months ago
Efficient Coding of Stroke-Rendered Paintings
There are more and more applications of nonphotorealistic rendered images, sketches and drawings. Several techniques for generating such imagery are widely known. The stochastic p...
Levente Kovács, Tamás Szirány...
AOSD
2007
ACM
13 years 11 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
ICC
2007
IEEE
115views Communications» more  ICC 2007»
13 years 11 months ago
Efficient Estimation of More Detailed Internet IP Maps
Router-level maps of the Internet implicate a large body of research on network management, overlay networks, performance evaluation, and security. The inaccuracies in these maps r...
Sangmin Kim, Khaled Harfoush
CP
2006
Springer
13 years 11 months ago
Towards an Efficient SAT Encoding for Temporal Reasoning
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
Duc Nghia Pham, John Thornton, Abdul Sattar