2233 search results - page 226 / 447 » On the Complexity of Theory Curbing |
150
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
133
click to vote
HICSS
2008
IEEE
16 years 1 months ago
2008
IEEE
Urban simulation systems can be a powerful tool for helping to understand the complex, long-term consequences of urban planning decisions. Simulation results are summarized and re...
152
click to vote
ISPDC
2008
IEEE
16 years 29 days ago
2008
IEEE
Multi–comparand associative processors are efficient in parallel processing of complex search problems that arise from many application areas including computational geometry, ...
160
click to vote
SECURWARE
2008
IEEE
16 years 28 days ago
2008
IEEE
Trust network analysis with subjective logic (TNA-SL) simplifies complex trust graphs into series-parallel graphs by removing the most uncertain paths to obtain a canonical graph...
189
click to vote
AICT
2007
IEEE
16 years 27 days ago
2007
IEEE
Based on the good time-frequency localization of the pulse shaping, it is possible to build a multicarrier modulation that reduces both narrowband interferences and multipath chan...