Sciweavers

43264 search results - page 539 / 8653
» Comparing models of computation
Sort
View
186
Voted
COR
2008
133views more  COR 2008»
15 years 7 months ago
A new constraint programming approach for the orthogonal packing problem
The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method ...
François Clautiaux, Antoine Jouglet, Jacque...
227
Voted
APSEC
1996
IEEE
15 years 11 months ago
M-base : An Application Development Environment for End-user Computing based on Message Flow
Explosive increase in end-user computing on distributed systems requires that end-users develop application software by themselves. One solution is given as aformula of "adom...
Takeshi Chusho, Yuji Konishi, Masao Yoshioka
157
Voted
RT
2005
Springer
16 years 27 days ago
Fast Exact From-Region Visibility in Urban Scenes
We present a fast exact from-region visibility algorithm for 2.5D urban scenes. The algorithm uses a subdivision of line space for identifying visibility interactions in a 2D foot...
Jirí Bittner, Peter Wonka, Michael Wimmer
FTCGV
2011
122views more  FTCGV 2011»
14 years 11 months ago
Structured Learning and Prediction in Computer Vision
Powerful statistical models that can be learned efficiently from large amounts of data are currently revolutionizing computer vision. These models possess a rich internal structur...
Sebastian Nowozin, Christoph H. Lampert
213
Voted
ICNS
2009
IEEE
16 years 2 months ago
Impact of Obstacles on the Degree of Mobile Ad Hoc Connection Graphs
What is the impact of obstacles on the graphs of connections between stations in Mobile Ad hoc Networks? In order to answer, at least partially, this question, the first step is ...
Cédric Gaël Aboue-Nze, Fréd&eac...