3825 search results - page 192 / 765 » More on pooling spaces |
147
click to vote
ATMOS
2008
15 years 8 months ago
2008
We present an extension of the well-known time-expanded approach for timetable information. By remodeling unimportant stations, we are able to obtain faster query times with less s...
176
click to vote
CAGD
2010
15 years 6 months ago
2010
Abstract. Nonnegative bivariate interpolants to scattered data are constructed using some C1 macro-element spline spaces. The methods are local, and rely on adjusting gradients at ...
139
click to vote
JCT
2006
15 years 6 months ago
2006
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
164
click to vote
SOCIALCOM
2010
15 years 4 months ago
2010
: Networks having several hundred or more nodes and significant edge probabilities are extremely difficult to visualize. They typically appear as dense clumps, with the various sub...
183
click to vote
VIZSEC
2007
Springer
16 years 17 days ago
2007
Springer
Monitoring host behavior in a network is one of the most essential tasks in the fields of network monitoring and security since more and more malicious code in the wild internet c...