2516 search results - page 456 / 504 » When is there a representer theorem |
150
click to vote
SIGSOFT
2009
ACM
16 years 6 months ago
2009
ACM
Software engineering researchers have long been interested in where and why bugs occur in code, and in predicting where they might turn up next. Historical bug-occurence data has ...
197
click to vote
SIGSOFT
2003
ACM
16 years 6 months ago
2003
ACM
Writes via unchecked pointer dereferences rank high among vulnerabilities most often exploited by malicious code. The most common attacks use an unchecked string copy to cause a b...
149
click to vote
WWW
2007
ACM
16 years 6 months ago
2007
ACM
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...
175
click to vote
WWW
2007
ACM
16 years 6 months ago
2007
ACM
The Web is rapidly moving towards a platform for mass collaboration in content production and consumption from three screens: computers, mobile phones, and TVs. While there has be...
174
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
This paper discusses generating document structure from annotated media repositories in a domain-independent manner. This approaches the vision of a universal RDF browser. We star...